Graph matching using conformal module

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Matching 3D Shapes Using 2D Conformal Representations

Matching 3D shapes is a fundamental problem in Medical Imaging with many applications including, but not limited to, shape deformation analysis, tracking etc. Matching 3D shapes poses a computationally challenging task. The problem is especially hard when the transformation sought is diffeomorphic and non-rigid between the shapes being matched. In this paper, we propose a novel and computationa...

متن کامل

DOMINATION NUMBER OF TOTAL GRAPH OF MODULE

 Let $R$ be a commutative ring and $M$ be an $R$-module with $T(M)$ as subset, the set of torsion elements. The total graph of the module denoted by $T(Gamma(M))$, is the (undirected) graph with all elements of $M$ as vertices, and for distinct elements $n,m in M$, the vertices $n$ and $m$ are adjacent if and only if $n+m in T(M)$. In this paper we study the domination number of $T(Gamma(M))$ a...

متن کامل

Fingerprint identification using graph matching

Abstract--A new algorithm for automated fingerprint encoding and matching is presented. The algorithm is intended to be insensitive to imperfections introduced during fingerprint registration, such as noise. distortion and displacement. A fingerprint is represented in the form of a graph whose nodes correspond to ridges in the print. Edges of the graph connect nodes that represent neighboring o...

متن کامل

THE ZERO-DIVISOR GRAPH OF A MODULE

Let R be a commutative ring with identity and M an R-module. In this paper, we associate a graph to M, sayΓ(RM), such that when M=R, Γ(RM) coincide with the zero-divisor graph of R. Many well-known results by D.F. Anderson and P.S. Livingston have been generalized for Γ(RM). We Will show that Γ(RM) is connected withdiam Γ(RM)≤ 3 and if Γ(RM) contains a cycle, then Γ(RM)≤4. We will also show tha...

متن کامل

Appearance Graph Generation Using Ray Tracing and Graph Matching

A method to obtain an approximation of appearance graphs of arbitrary objects is presented. The approach utilises ray tracing { based on CAD or other 3D object models { and graph matching. Geometric models are extended to include additional, e.g. chromatic, texture and illumination information. The viewing space is tessellated in a manner which suits the desired application , and reference imag...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: EURASIP Journal on Image and Video Processing

سال: 2019

ISSN: 1687-5281

DOI: 10.1186/s13640-019-0407-x